ccg2lambda: A Compositional Semantics System
نویسندگان
چکیده
We demonstrate a simple and easy-to-use system to produce logical semantic representations of sentences. Our software operates by composing semantic formulas bottom-up given a CCG parse tree. It uses flexible semantic templates to specify semantic patterns. Templates for English and Japanese accompany our software, and they are easy to understand, use and extend to cover other linguistic phenomena or languages. We also provide scripts to use our semantic representations in a textual entailment task, and a visualization tool to display semantically augmented CCG trees in HTML.
منابع مشابه
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning to overcome the computational complexity of model checking. This paper presents Translation-Based Compositional Reasoning (TBCR), an approach to application of compositional reasoning in the context of model checking ...
متن کاملCompositional semantics and behavioral equivalences for P Systems
The aim of the paper is to give a compositional semantics in the style of the Structural Operational Semantics (SOS) and to study behavioral equivalence notions for P Systems. Firstly, we consider P Systems with maximal parallelism and without priorities. We define a process algebra, called P Algebra, whose terms model membranes, we equip the algebra with a Labeled Transition System (LTS) obtai...
متن کاملThe Hierarchical Compositional Interchange Format
In computer science, the development of hierarchical automata / statecharts has lead to stepwise development of complex discrete systems. Such a concept is absent in the Compositional Interchange Format (CIF), which is a modelling language based on hybrid automata. In this article we extend the CIF language with the concept of hierarchy, which results in the Hierarchical Compositional Interchan...
متن کاملCompositionality Properties of SLD-Derivations
The paper introduces a semantics for definite logic programs expressed in term of SLD-derivations and studies various properties of SLD-derivations by using the above semantics. The semantics of a program is a goal-independent denotation, which can equivalently be specified by a denotational semantics and a transition system. The denotation is proved to be correct, minimal, AND-compositional an...
متن کاملA Compositional Semantics for Modelica-style Variable-structureModeling
Modelica traditionally has a non-compositional semantic definition, based on so-called “flattening”. But in the realm of programming languages and theoretical computer science it is by now an accepted principle that semantics should be given in a compositional way. Such a semantics is given in this paper for Modelica-style languages. Moreover, the approach is also used to consider more general ...
متن کامل